Distributed dynamic consensus under quantized communication data
نویسندگان
چکیده
Distributed dynamic average consensus is investigated under quantized communication data. We use a uniform quantizer with constant quantization step-size to deal with the saturation caused by the dynamic consensus error and propose a communication feedback-based distributed consensus protocol suitable for directed time-varying topologies to make the internal state of each agent’s encoder consistent with the output of its neighbors’ decoder. For the case where the communication topology is directed, balanced and periodically connected, it is shown that if the difference of the reference inputs satisfies some boundedness condition, then the designed quantized dynamic consensus protocol can ensure the states of all the agents achieve dynamic average consensus with arbitrarily small steady state error by properly choosing system parameters. The lower bound of the required quantization levels and the method to choose the system parameters are also presented. Copyright © 2014 John Wiley & Sons, Ltd.
منابع مشابه
Quantized Data-Based Distributed Consensus under Directed Time-Varying Communication Topology
Distributed average consensus (DAC) is investigated for multiagent systems (MASs) with directed time-varying communication topology and quantized communication data. We propose a communication feedback–based distributed consensus protocol suitable for directed time-varying topologies to deal with the inconsistency between the internal state of each agent’s encoder and the output of its neighbor...
متن کاملQuantized Cooperative Control
In this thesis project, we consider the cooperative control of multi-agent systems under limited communication between the individual agents. In particular, quantized values of the relatives states between neighboring agents are used as the control parameters for each agent. As an introductory part, the theoretical framework for the distributed consensus problem under perfect communication is r...
متن کاملFast, Robust, Quantizable Approximate Consensus
We introduce a new class of distributed algorithms for the approximate consensus problem in dynamic rooted networks, which we call amortized averaging algorithms. They are deduced from ordinary averaging algorithms by adding a value-gathering phase before each value update. This results in a drastic drop in decision times, from being exponential in the number n of processes to being polynomial ...
متن کاملAmortized Averaging Algorithms for Approximate Consensus
We introduce a new class of distributed algorithms for the approximate consensus problem in dynamic rooted networks, which we call amortized averaging algorithms. They are deduced from ordinary averaging algorithms by adding a value-gathering phase before each value update. This allows their decision time to drop from being exponential in the number n of processes to being linear under the assu...
متن کاملCommunication constraints in the state agreement problem
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems. Particular examples are systems comprised of multiple agents. When it comes to coordinately control a group of autonomous mobile agents in order to achieve a common task, communication constraints impose limits on the achievable control performance. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015